Secure elliptic curves and their performance
نویسندگان
چکیده
منابع مشابه
On the Performance of Provably Secure Hashing with Elliptic Curves
We propose a cryptographic hash function based on the difficulty of computing discrete logarithms in the group of points of an elliptic curve over a finite field. We prove the security of the hash function and analyze the performance. Our implementation of the finite field, the elliptic curve arithmetic, and scalar multiplication is optimized for high throughput on modern 32-bit desktop process...
متن کاملElliptic Curves and Their Torsion
2 Elliptic Curves and Maps Between Them 2 2.1 The Group Operation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.2 Weierstrass Equations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.3 Maps Between Elliptic Curves . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.4 Dual Isogenies . . . . . . . . . . . . . . ....
متن کاملElliptic Curves and Their Statistics
It is curious how aggregates rather than single instances creep into our subject even when we aren't looking for statistical trouble. Here is an example. In the Erdös spirit, I'll offer a $5 prize for anyone who can manage to provide a proof of the fact that • every linear form aX+b with a, b ∈ Z relatively prime represents at least one prime number; and yet • the proof doesn't actually show th...
متن کاملElliptic Curves and their use in Cryptography
The security of many cryptographic protocols depends on the diiculty of solving the so-called \discrete logarithm" problem, in the multiplica-tive group of a nite eld. Although, in the general case, there are no polynomial time algorithms for this problem, constant improvements are being made { with the result that the use of these protocols require much larger key sizes, for a given level of s...
متن کاملA Secure Money Transaction Scheme (Identification Scheme) using Elliptic Curves
Identification protocols have an important role for building secure communications amongst two or more entities over the internet. In this paper we introduce a new identification scheme (or money transaction protocol) based on the elliptic curve Diffie Hellman problem. We show that our protocol meets the security attributes under the assumption that the elliptic curve discrete logarithm problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logic Journal of the IGPL
سال: 2018
ISSN: 1367-0751,1368-9894
DOI: 10.1093/jigpal/jzy035